On Incremental Quantitative Verification for Probabilistic Systems

نویسندگان

  • Marta Z. Kwiatkowska
  • David Parker
  • Hongyang Qu
  • Mateusz Ujma
چکیده

Quantitative verification techniques offer an effective means of computing performance and reliability properties for a wide range of systems. In many cases, it is necessary to perform repeated analyses of a system, for example to identify trends in results, determine optimal system parameters or when performing online analysis for adaptive systems. We argue the need for incremental quantitative verification techniques which are able to reuse results from previous verification runs in order to improve efficiency. We report on recently proposed techniques for incremental quantitative verification of Markov decision processes, based on a decomposition of the model into its strongly connected components. We give an overview of the method, describe a number of useful optimisations and show experimental results that illustrate significant gains in run-time performance using the incremental approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Runtime Verification of Probabilistic Systems

Probabilistic verification techniques have been proposed for runtime analysis of adaptive software systems, with the verification results being used to steer the system so that it satisfies certain Qualityof-Service requirements. Since systems evolve over time, and verification results are required promptly, efficiency is an essential issue. To address this, we present incremental verification ...

متن کامل

Department of Computer Science INCREMENTAL RUNTIME VERIFICATION OF PROBABILISTIC SYSTEMS

Probabilistic verification techniques have been proposed for runtime analysis of adaptive software systems, with the verification results being used to steer the system so that it satisfies certain Qualityof-Service requirements. Since systems evolve over time, and verification results are required promptly, efficiency is an essential issue. To address this, we present incremental verification ...

متن کامل

Automated quantitative software verification

Many software systems exhibit probabilistic behaviour, either added explicitly, to improve performance or to break symmetry, or implicitly, through interaction with unreliable networks or faulty hardware. When employed in safety-critical applications, it is important to rigorously analyse the behaviour of these systems. This can be done with a formal verification technique called model checking...

متن کامل

Computing Laboratory QUANTITATIVE MULTI-OBJECTIVE VERIFICATION FOR PROBABILISTIC SYSTEMS

We present a verification framework for analysing multiple quantitative objectives of systems that exhibit both nondeterministic and stochastic behaviour. These systems are modelled as probabilistic automata, enriched with cost or reward structures that capture, for example, energy usage or performance metrics. Quantitative properties of these models are expressed in a specification language th...

متن کامل

Quantitative Multi-objective Verification for Probabilistic Systems

We present a verification framework for analysing multiple quantitative objectives of systems that exhibit both nondeterministic and stochastic behaviour. These systems are modelled as probabilistic automata, enriched with cost or reward structures that capture, for example, energy usage or performance metrics. Quantitative properties of these models are expressed in a specification language th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014